Local Constraints in Combinatorial Optimization
نویسندگان
چکیده
Local Constraints in Combinatorial Optimization
منابع مشابه
Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملGPU Parallel Program for the Bin Packing Problem
Combinatorial optimization is a class of problems where an optimal solution must be chosen from a finite set of possible solutions. A combinatorial optimization problem consists of 3 parts: a set of configurations, one or more optimizations, and one or more constraints. To solve a combinatorial optimization problem, a configuration must be chosen which is the most optimal of all configurations ...
متن کاملISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES CONSIDERING WEIGHT MINIMIZATION AND LOCAL STRESS CONSTRAINTS
The Isogeometric Analysis (IA) is utilized for structural topology optimization considering minimization of weight and local stress constraints. For this purpose, material density of the structure is assumed as a continuous function throughout the design domain and approximated using the Non-Uniform Rational B-Spline (NURBS) basis functions. Control points of the density surface are...
متن کاملSet Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This modelling device has been around for quite some time in the constraint programming area, and proved its usefulness in many applications. This paper introduces set variables and set constraints also in the local search area. It presents a way of representing set variable...
متن کامل